Remarks on power-law random graphs

نویسندگان

چکیده

The theory of graphons is an important tool in understanding properties large networks. We investigate a power-law random graph model and cast it the graphon framework. distinctively different structures limit are explored detail sub-critical super-critical regimes. In regime, empty with high probability, rare event that non-empty, consists single edge. Contrarily, non-trivial exists limit, serves as uncovered boundary case between types convergence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance Labelings on Random Power Law Graphs

Methods for answering distance queries on large graphs through a preprocessed data structure have a rich history of study. Recent evaluations on social and information networks have shown that there are very efficient landmark based labeling schemes on these networks, even for exact distances. However, it is unclear what are the essential properties of these networks that make short labelings p...

متن کامل

Random Walks with Lookahead on Power Law Random Graphs

We show that in power law random graphs, a.s., the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear. Searching a graph by simulating a random walk is a natural way to abstract Web crawling [5]. Recently, the random walk simulation method has been also proposed to search P2P networks [11], [4], [10]. Therefore, it is important to characterize the ...

متن کامل

Eigenvalues of Random Power Law Graphs

Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...

متن کامل

Eigenvalues of Random Power Law Graphs (DRAFT)

Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum degree. When 2 < β < 2.5, the largest eigenvalue is heavily concentrated at cm3−β for some constant c ...

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 2022

ISSN: ['1879-209X', '0304-4149']

DOI: https://doi.org/10.1016/j.spa.2022.08.002